A note on the Markoff condition and central words
نویسندگان
چکیده
We define Markoff words as certain factors appearing in bi-infinite words satisfying the Markoff condition. We prove that these words coincide with central words, yielding a new characterization of Christoffel words.
منابع مشابه
A Collocation Method with Modified Equilibrium on Line Method for Imposition of Neumann and Robin Boundary Conditions in Acoustics (TECHNICAL NOTE)
A collocation method with the modified equilibrium on line method (ELM) forimposition of Neumann and Robin boundary conditions is presented for solving the two-dimensionalacoustical problems. In the modified ELM, the governing equations are integrated over the lines onthe Neumann (Robin) boundary instead of the Neumann (Robin) boundary condition equations. Inother words, integration domains are...
متن کاملGeneralized Markoff Equations, Euclid Trees, and Chebyshev Polynomials
The Markoff equation is x+y+z = 3xyz, and all of the positive integer solutions of this equation occur on one tree generated from (1, 1, 1), which is called the Markoff tree. In this paper, we consider trees of solutions to equations of the form x + y + z = xyz + A. We say a tree of solutions satisfies the unicity condition if the maximum element of an ordered triple in the tree uniquely determ...
متن کاملPerformance Study of a Solar Integrated Central Heating System of a Residential Building Using Trnsys- an Hourly Simulation Model (RESEARCH NOTE)
In this investigation, the performance of an existing heating system of a residential building incorporated with an array of solar thermal collectors was studied. For this purpose, transient systems simulation program model was assembled to estimate the hour-by-hour performance of the existing and the system equipped with the solar thermal collectors in terms of the provided space air condition...
متن کاملCombinatorial Interpretations for the Markoff Numbers
In this paper we generalize the concept of Markoff numbers with the construction of Markoff polynomials. We then present a combinatorial model based on a family of recursively-defined graphs which we call snakes, such that the Markoff polynomials and Markoff numbers are respectively weighted and unweighted enumerators of the perfect matchings of snakes. We have found four proofs of the central ...
متن کاملA Note on Absolute Central Automorphisms of Finite $p$-Groups
Let $G$ be a finite group. The automorphism $sigma$ of a group $G$ is said to be an absolute central automorphism, if for all $xin G$, $x^{-1}x^{sigma}in L(G)$, where $L(G)$ be the absolute centre of $G$. In this paper, we study some properties of absolute central automorphisms of a given finite $p$-group.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 105 شماره
صفحات -
تاریخ انتشار 2008